A Note on Random k-SAT for Moderately Growing k
نویسندگان
چکیده
Consider a random instance I of k-SAT with n variables and m clauses. Suppose that θ, c > 0 are any fixed real numbers. Let k = k(n) ≥ ( 1 2 + θ ) log2 n. We prove that lim n→∞ Pr(I is satifiable) = { 1 m ≤ ( 1− c √ n ) 2kn ln 2 0 m ≥ ( 1 + c √ n ) 2kn ln 2.
منابع مشابه
Random k-SAT: The Limiting Probability for Satisfiability for Moderately Growing k
We consider a random instance Im = Im,n,k of k-SAT with n variables and m clauses, where k = k(n) satisfies k − log 2 n → ∞. Let m = 2(n ln 2 + c) for an absolute constant c. We prove that lim n→∞ Pr(Im is satisfiable) = e −e
متن کاملRandom k-Sat: A Tight Threshold For Moderately Growing k
We consider a random instance I of k-SAT with n variables and m clauses, where k = k(n) satis es k log 2 n ! 1. Let m0 = 2 k n ln 2 and let = (n) > 0 be such that n!1. We prove that lim n!1 Pr(I is satis able) = ( 1 m (1 )m0 0 m (1 + )m0
متن کاملNote on strong refutation algorithms for random k-SAT formulas
We present a simple strong refutation algorithm for random k-SAT formulas. Our algorithm applies to random k-SAT formulas on n variables with ω(n)n(k+1)/2 clauses for any ω(n) → ∞. In contrast to the earlier results of Coja-Oghlan, Goerdt, and Lanka (for k = 3, 4) and Coja-Oghlan, Cooper, and Frieze (for k ≥ 5), which address the same problem for even sparser formulas our algorithm is more elem...
متن کاملUPPER BOUND ON THE SATISFIABILITY THRESHOLD OF REGULAR RANDOM (k, s)-SAT PROBLEM
We consider a strictly regular random (k, s)-SAT problem and propose a GSRR model for generating its instances. By applying the first moment method and the asymptotic approximation of the γth coefficient for generating function f(z), where λ and γ are growing at a fixed rate, we obtain a new upper bound 2 log 2−(k+1) log 2/2+ εk for this problem, which is below the best current known upper boun...
متن کاملLow Power March Memory Test Algorithm for Static Random Access Memories (TECHNICAL NOTE)
Memories are most important building blocks in many digital systems. As the Integrated Circuits requirements are growing, the test circuitry must grow as well. There is a need for more efficient test techniques with low power and high speed. Many Memory Built in Self-Test techniques have been proposed to test memories. Compared with combinational and sequential circuits memory testing utilizes ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 19 شماره
صفحات -
تاریخ انتشار 2012